Duality Theory of the Optimal Two-Block H∞ Problem
نویسندگان
چکیده
This paper provides the Banach duality theory structure of the optimal two-block H∞ problem. Alignment conditions are obtained and show that the optimal solution is flat in general, and unique in the SISO case. It is also proved that under specific conditions a Hankel-Toepltiz operator achieves its norm on the discrete spectrum, therefore generalizing a similar result obtained formerly for finitedimensional (rational) systems. The norm of this Hankel-Toeplitz operator corresponds to the optimal two-block H∞ performance. The dual description leads naturally to a numerical solution based on convex programming for linear time-invariant (LTI) (possibly infinite dimensional) systems. Copyright c © 2002 John Wiley & Sons, Ltd.
منابع مشابه
On The Optimal Two-Block H∞ Problem
This paper provides the duality structure of the optimal two-block H∞ problem. The dual description leads naturally to a numerical solution based on convex programming for LTI (including infinite dimensional) systems. Alignment conditions are obtained and show that the optimal solution is flat in general, and unique in the SISO case. It is also proved that under specific conditions a well-known...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کامل